Recursive Sequences and Faithfully Flat Extensions
نویسندگان
چکیده
منابع مشابه
Recursive Sequences and Faithfully Flat Extensions
This note arises from an attempt to give some model-theoretic interpretation of the concept of flatness. It is well-known that a necessary condition for a ring morphism A → B to be faithfully flat, is that any linear system of equations with coefficients from A which has a solution over B, must have already a solution over A. In fact, if we strenghten this condition to any solution over B comes...
متن کاملReal Recursive Functions and Real Extensions of Recursive Functions
Recently, functions over the reals that extend elementarily computable functions over the integers have been proved to correspond to the smallest class of real functions containing some basic functions and closed by composition and linear integration. We extend this result to all computable functions: functions over the reals that extend total recursive functions over the integers are proved to...
متن کاملBarker Sequences and Flat Polynomials
A Barker sequence is a finite sequence of integers, each ±1, whose aperiodic autocorrelations are all as small as possible. It is widely conjectured that only finitely many Barker sequences exist. We describe connections between Barker sequences and several problems in analysis regarding the existence of polynomials with ±1 coefficients that remain flat over the unit circle according to some cr...
متن کاملRecursive sequences and polynomial congruences
We consider the periodicity of recursive sequences defined by linear homogeneous recurrence relations of arbitrary order, when they are reduced modulo a positive integer m. We show that the period of such a sequence with characteristic polynomial f can be expressed in terms of the order of ω = x + f as a unit in the quotient ring ޚ m [ω] = ޚ m [x]/ f. When m = p is prime, this order can be ...
متن کاملLinear Recursive Sequences
A sequence is an infinite list of numbers, like The numbers in the sequence are called its terms. The general form of a sequence is a 1 , a 2 , a 3 ,. .. where a n is the n-th term of the sequence. In the example (1) above, a 1 = 1, a 2 = 2, a 3 = 4, and so on. The notations {a n } or {a n } ∞ n=1 are abbreviations for a 1 , a Occasionally the indexing of the terms will start with something oth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 2001
ISSN: 0035-7596
DOI: 10.1216/rmjm/1021249447